(Anonymous) Fully Secure Constant-Size Ciphertext HIBE From Type-3 Pairings
نویسندگان
چکیده
This paper takes a comprehensive look at hierarchical identity-based encryption (HIBE) schemes with constant-size ciphertexts which provide desirable provable guarantees and can be implemented using the most efficient bilinear pairings, namely, Type-3 pairings. Our work results in six new HIBE schemes. The first construction, DPVS-HIBE , is obtained by extending the IBE scheme of Chen et.al. The extension uses an identity-hashing technique introduced by Boneh, Boyen and Goh (BBG) in 2005. The second construction, DPVS-AHIBE , is obtained by appending the anonymity property to DPVS-HIBE via a method introduced by Boyen and Waters and later used in the context of constantsize ciphertext HIBE by Seo et.al. Scheme DPVS-HIBE does not allow the identity components to assume the value zero. It is extended to DPVS-HIBE-0 that allows zero to be an identity component. The construction DPVS-AHIBE-0 results from adding anonymity to DPVS-HIBE-0. The rest of the two constructions LW -HIBE and LW -AHIBE are obtained by extending the Type-3 pairing based IBE scheme due to Lewko and Waters (2010). All six schemes are proved secure against adaptive-identity attacks using the technique of dual system encryption and dual pairing vector spaces. Based on currently known techniques, these schemes make a major contribution to the state-of-the-art on efficient HIBE constructions.
منابع مشابه
Anonymous Constant-Size Ciphertext HIBE from Asymmetric Pairings
We present a new hierarchical identity based encryption (HIBE) scheme with constant-size ciphertext that can be implemented using the most efficient bilinear pairings, namely, Type-3 pairings. In addition to being fully secure, our scheme is anonymous. The HIBE is obtained by extending an asymmetric pairing based IBE scheme due to Lewko and Waters. The extension uses the approach of Boneh-Boyen...
متن کاملAnonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
Efficient and privacy-preserving constructions for search functionality on encrypted data is important issues for data outsourcing, and data retrieval, etc. Fully secure anonymous Hierarchical ID-Based Encryption (HIBE) schemes is useful primitives that can be applicable to searchable encryptions [4], such as ID-based searchable encryption, temporary searchable encryption [1], and anonymous for...
متن کاملAnonymity from Asymmetry: New Constructions for Anonymous HIBE
A Hierarchical Identity Based Encryption (HIBE) system is anonymous if the ciphertext reveals no information about the public-key used to create it. While there are multiple constructions for secure HIBE, far fewer constructions exist for anonymous HIBE. In this paper we show how to use asymmetric pairings to convert a large family of IBE and HIBE constructions into anonymous IBE and HIBE systems.
متن کاملEfficient (Anonymous) Compact HIBE from Standard Assumptions
We present two hierarchical identity-based encryption (HIBE) schemes, denoted as H1 and H2, from Type-3 pairings with constant sized ciphertexts. Scheme H1 achieves anonymity while H2 is non-anonymous. The constructions are obtained by extending the IBE scheme recently proposed by Jutla and Roy (Asiacrypt 2013). Security is based on the standard decisional Symmetric eXternal Diffie-Hellman (SXD...
متن کاملConstant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions
At Eurocrypt 2005, Boneh, Boyen and Goh presented a constant-size ciphertext hierarchical identity-based encryption (HIBE) protocol. Our main contribution is to present a variant of the BBG-HIBE. The new HIBE is proved to be secure (without any degradation) in an extension of the s-ID model (denoted the s-ID model) and the components of the identities are from Zp, where p is a suitable large pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012